一类反向混合单调算子方程组解的存在惟一性

运用锥与半序理论和非对称迭代方法,讨论半序Banach空间一类反向混合单调算子方程组解的存在惟一性,并给出了迭代序列收敛于解的误差估计,同时推广讨论了非反向混合单调算子方程组解的存在惟一性.所得结果改进和推广了混合单调算子方程某些已知的结果.     

改进的AHP法在目标价值排序中的应用

针对在应用AHP法时,传统的标度法可能导致判断矩阵一致性与思维一致性脱节,进而破坏层次分析法的优选排序功能的问题。首先分析了传统的1～9标度的不足,然后通过引入指数(0,2)标度,建立了满足一致性要求的判断矩阵,改进了层次分析法。最后将改进的AHP法应用于战场炮兵的主要攻击目标价值排序的评估,进一步提高了评估的准确性。     

(Re-)emergent orders: understanding the negotiation(s) of rebel governance

Abstract

The concept of order is often neglected in the study of conflict – seemingly such a ‘disordering’ process. With the recent increase in the examination of rebel governance however, bringing order back into our understanding of rebel and insurgent groups has much to offer in exploring the everyday politics which connect authorities, rebel movements and the population itself, in a complex mass of intersubjective and power-based interactions and negotiations. Rebels both shape and are shaped by existing forms of order in complex and ongoing ways. This article explores how varying elements interact in the negotiation, framing and enforcement of order and develops an original analytical framework to examine the perpetual negotiations of rebel movements in their attempts to cement their control.     

Some comparisons of residual life of coherent systems with exchangeable components

Most of the research, on the study of the reliability properties of technical systems, assume that the components of the system operate independently. However, in real life situation, it is more reasonable to assume that there is dependency among the components of the system. In this article, we give sufficient conditions based on the signature and the joint distribution of component lifetimes to obtain stochastic ordering results for coherent and mixed systems with exchangeable components. Some stochastic orders on dynamic (or conditional) signature of coherent systems are also provided. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 549–556, 2014     

A branch and bound algorithm for the minimum storage‐time sequencing problem

The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001     

Optimal stopping in software testing

In this paper we address the problem of how to decide when to terminate the testing/modification process and to release the software during the development phase. We present a Bayesian decision theoretic approach by formulating the optimal release problem as a sequential decision problem. By using a non‐Gaussian Kalman filter type model, proposed by Chen and Singpurwalla (1994), to track software reliability, we are able to obtain tractable expressions for inference and determine a one‐stage look ahead stopping rule under reasonable conditions and a class of loss functions. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

On the application and extension of system signatures in engineering reliability

Following a review of the basic ideas in structural reliability, including signature‐based representation and preservation theorems for systems whose components have independent and identically distributed (i.i.d.) lifetimes, extensions that apply to the comparison of coherent systems of different sizes, and stochastic mixtures of them, are obtained. It is then shown that these results may be extended to vectors of exchangeable random lifetimes. In particular, for arbitrary systems of sizes m < n with exchangeable component lifetimes, it is shown that the distribution of an m‐component system's lifetime can be written as a mixture of the distributions of k‐out‐of‐n systems. When the system has n components, the vector of coefficients in this mixture representation is precisely the signature of the system defined in Samaniego, IEEE Trans Reliabil R–34 (1985) 69–72. These mixture representations are then used to obtain new stochastic ordering properties for coherent or mixed systems of different sizes. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Stein–Chen approximation and error bounds for order fill rates in assemble‐to‐order systems

Assemble‐to‐order (ATO) is an important operational strategy for manufacturing firms to achieve quick response to customer orders while keeping low finished good inventories. This strategy has been successfully used not only by manufacturers (e.g., Dell, IBM) but also by retailers (e.g., Amazon.com). The evaluation of order‐based performance is known to be an important but difficult task, and the existing literature has been mainly focused on stochastic comparison to obtain performance bounds. In this article, we develop an extremely simple Stein–Chen approximation as well as its error‐bound for order‐based fill rate for a multiproduct multicomponent ATO system with random leadtimes to replenish components. This approximation gives an expression for order‐based fill rate in terms of component‐based fill rates. The approximation has the property that the higher the component replenishment leadtime variability, the smaller the error bound. The result allows an operations manager to analyze the improvement in order‐based fill rates when the base‐stock level for any component changes. Numerical studies demonstrate that the approximation performs well, especially when the demand processes of different components are highly correlated; when the components have high base‐stock levels; or when the component replenishment leadtimes have high variability. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

基于时间序列预测的独立分量排序

独立分量排序是独立分量分析的热点问题,是提高特征空间鲁棒性和减少计算复杂度的必要前提。结合ICA在时间序列预测的应用,给出了基于一阶差分和最小方差误差的多分量联合重构预测排序准则。为了避免联合优化中出现的海量计算问题,提出了添加-测试-接受机制(ATA)的次优搜索方法。实验结果表明,和传统排序方法比较,新方法具有优异的预测能力和搜索效率。     

多品种备件联合申请的聚集效应

根据联合申请的备件品种范围的不同,提出了3种订货策略,即单独申请、统一申请和联合申请,并设计了联合申请策略的启发式算法。该算法首先确定订购最频繁的备件,将其申请周期作为基本申请周期,其他备件申请周期是该周期的整倍数;其次寻求各种备件的最优订货倍数;最后确定各种备件的订购量。数值实例表明：联合申请策略的聚集效应明显优于单独申请策略和统一申请策略,对多品种库存控制策略的研究有一定意义。